Separable Diophantine equations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine approximation and Diophantine equations

The first course is devoted to the basic setup of Diophantine approximation: we start with rational approximation to a single real number. Firstly, positive results tell us that a real number x has “good” rational approximation p/q, where “good” is when one compares |x − p/q| and q. We discuss Dirichlet’s result in 1842 (see [6] Course N◦2 §2.1) and the Markoff–Lagrange spectrum ([6] Course N◦1...

متن کامل

Diophantine Approximations, Diophantine Equations, Transcendence and Applications

This article centres around the contributions of the author and therefore, it is confined to topics where the author has worked. Between these topics there are connections and we explain them by a result of Liouville in 1844 that for an algebraic number α of degree n ≥ 2, there exists c > 0 depending only on α such that | α− p q |> c qn for all rational numbers p q with q > 0. This inequality i...

متن کامل

Diophantine Equations Related with Linear Binary Recurrences

In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...

متن کامل

Diophantine Equations and Congruences

We present conditions for quadratic Diophantine equations of the form ax2 − by2 = ±1, (where 1 < a < b are integers) for which there are no solutions (x, y), yet for which there are solutions modulo n for all n ≥ 1. This generalizes work in the literature which follow as very special cases. Mathematics Subject Classification: Primary: 11D09, 11R11, 11A55; Secondary: 11R29

متن کامل

Elliptic binomial diophantine equations

The complete sets of solutions of the equation (n k ) = (m ` ) are determined for the cases (k, `) = (2, 3), (2, 4), (2, 6), (2, 8), (3, 4), (3, 6), (4, 6), (4, 8). In each of these cases the equation is reduced to an elliptic equation, which is solved by using linear forms in elliptic logarithms. In all but one case this is more or less routine, but in the remaining case ((k, `) = (3, 6)) we h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1945

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1945-0012087-x